Learning binary relations using weighted majority voting
نویسندگان
چکیده
منابع مشابه
On-line Learning of Binary Lexical Relations Using Two-dimensional Weighted Majority Algorithms
We consider the problem of learning a certain type of lexical semantic knowledge that can be expressed as a binary relation between words, such as the so-called sub-categorization of verbs (a verb-noun relation) and the compound noun phrase relation (a noun-noun relation). Speci cally, we view this problem as an on-line learning problem in the sense of Littlestone's learning model [Lit88] in wh...
متن کاملClassification confidence weighted majority voting using decision tree classifiers
In this paper a novel method is proposed to combine decision tree classifiers using calculated classification confidence values. This confidence in the classification is based on distance calculation to the relevant decision boundary. It is shown that these values – provided by individual classification trees – can be integrated to derive a consensus decision. The proposed combination scheme – ...
متن کاملA Weighted Majority Voting based on NMI for Cluster Analysis
Due to advancements in data acquisition, large amount of data are collected in daily basis. Analysis of the collected data is an important task to discover the patterns, extract the features, and make informed decisions. A vital step in data analysis is dividing the objects (elements, individuals) in different groups based on their similarities. One way to group the objects is clustering. Clust...
متن کاملError Rate Bounds and Iterative Weighted Majority Voting for Crowdsourcing
Crowdsourcing has become an effective and popular tool for human-powered computation to label large datasets. Since the workers can be unreliable, it is common in crowdsourcing to assign multiple workers to one task, and to aggregate the labels in order to obtain results of high quality. In this paper, we provide finite-sample exponential bounds on the error rate (in probability and in expectat...
متن کاملLearning Binary Preference Relations
It is a truth universally acknowledged that e-commerce platform users in search of an item that best suits their preferences may be oered a lot of choices. An item may be characterised by many aributes, which can complicate the process. Here the classic approach in decision support systems to put weights on the importance of each aribute is not always helpful as users may nd it hard to form...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 1995
ISSN: 0885-6125,1573-0565
DOI: 10.1007/bf00994017